An Extendible Hash for Multi-Precision Similarity Querying of Image Databases

نویسندگان

  • Shu Lin
  • M. Tamer Özsu
  • Vincent Oria
  • Raymond T. Ng
چکیده

We propose multi-precision similarity matching where the image is divided into a number of subblocks, each with its associated color histogram. We present experimental results showing that the spatial distribution information recorded by multiprecision color histograms helps to make similarity matching more precise. We also show that sub-image queries are much better supported with multi-precision color histograms. To minimize the overhead, we employ a filtering scheme based on the 3-dimensional average color vectors. We provide a formal result proving that filtering with multi-precision color histograms is complete. Finally, we develop a novel extendible hashing structure for indexing the average color vectors. We give experimental results showing that the proposed structure significantly outperforms the SR-tree.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deep Multi-label Hashing for Large-Scale Visual Search Based on Semantic Graph

Huge volumes of images are aggregated over time because many people upload their favorite images to various social websites such as Flickr and share them with their friends. Accordingly, visual search from large scale image databases is getting more and more important. Hashing is an efficient technique to large-scale visual content search, and learning-based hashing approaches have achieved gre...

متن کامل

Performance Analysis of a Main Memory Multi-Directory Hashing Technique

Optimal search in main memory databases requires at most one key comparison to locate a record. Extendible hashing becomes impractical when it is adapted to yield optimal search in main memory databases because of its large directory size. Multi-directory hashing techniques can provide significantly improved directory utilization over extendible hashing. The objective of this paper is to analyz...

متن کامل

Issues in Querying Multi-media Databases

Introduction The amount of information available to users, especially in the web, is growing exponentially month by month. To nd useful information in the web, users normally have to rely on some sort of keyword matching searches, and/or navigate their way through the list of pointers to objects in diierent data repositories. This is not enough to satisfy the needs of the ever more sophisticate...

متن کامل

On the Stability of Signature-Based Distance Functions for Content-Based Image Retrieval

Retrieving similar images from large image databases is a challenging task for today’s content-based retrieval systems. Aiming at high retrieval performance, these systems frequently capture the user’s notion of similarity through expressive image models and adaptive similarity measures. On the query side, image models can significantly differ in quality compared to those stored on the database...

متن کامل

Hashing with dual complementary projection learning for fast image retrieval

Due to explosive growth of visual content on the web, there is an emerging need of fast similarity search to efficiently exploit such enormous web contents from very large databases. Recently, hashing has become very popular for efficient nearest neighbor search in large scale applications. However, many traditional hashing methods learn the binary codes in a single shot or only employ a single...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001